Dynamic Trace Logic: Definition and Proofs? Bernhard Beckert and Daniel Bruns?? Karlsruhe Institute of Technology, Department of Informatics Abstract. Dynamic logic is an established instrument for program verification a

Source URL: formal.iti.kit.edu

• Automated theorem proving
• Proof theory
• Symbol
• Sequent
• Substitution
• First-order logic
• Hoare logic
• Method of analytic tableaux
• Polar coordinate system

The Combined KEAPPA - IWIL Workshops Proceedings Proceedings of the workshops Knowledge Exchange: Automated Provers and Proof Assistants and The 7th International Workshop on the Implementation of Logics held at

Source URL: www.cs.miami.edu

• Automated theorem proving
• Automated reasoning
• Proof assistant
• First-order logic
• Type theory
• TarskiGrothendieck set theory
• Mizar and Alcor
• Geoff Sutcliffe
• Jordan curve theorem
• Isabelle
• Mathematical logic
• Reasoning system

System Description: iProver – An Instantiation-Based Theorem Prover for First-Order Logic Konstantin Korovin? The University of Manchester School of Computer Science

Source URL: www.cs.man.ac.uk

• Automated theorem proving
• Logic in computer science
• Constraint programming
• Logic programming
• Rules of inference
• Resolution
• Boolean satisfiability problem
• Clause
• Small clause
• Reasoning system
• English relative clauses
• Unit propagation

Modular Bisimulation Theory for Computations and Values Martin Churchill and Peter D. Mosses {m.d.churchill,p.d.mosses}@swansea.ac.uk Department of Computer Science, Swansea University, Swansea, UK

Source URL: plancomps.dreamhosters.com

• Logic in computer science
• Theoretical computer science
• Automated theorem proving
• Logic programming
• Bisimulation
• Substitution
• Operational semantics
• Transition system
• Derivative
• Permutation
• Variable
• -calculus

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Proof assistants
• Formal methods
• Isabelle
• Type theory
• HOL
• Automated reasoning
• Computer algebra system
• Vienna Development Method
• Software development

COMP 520 FallType checking (1) COMP 520 Fall 2007

Source URL: www.sable.mcgill.ca

• Type theory
• Symbol
• Type system
• Mathematical logic
• Logic in computer science
• Theoretical computer science
• Automated theorem proving
• Logic programming

A type system for Continuation Calculus Herman Geuvers Radboud University Nijmegen, Technical University Eindhoven, the Netherlands

Source URL: www.cs.ru.nl

• Mathematics
• Logic
• Mathematical logic
• Type theory
• Automated theorem proving
• Logic programming
• Models of computation
• Logic in computer science
• Substitution
• Structure
• Model theory
• Parity of a permutation

leanCoP 2.0 and ileanCoP 1.2 : High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) Jens Otten Institut f¨

Source URL: www.jens-otten.de

leanCoP 2.0 and ileanCoP 1.2 : High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) Jens Otten Institut f¨

Source URL: www.cs.uni-potsdam.de

Verifying an Open Compiler Using Multi-Language Semantics James T. Perconti and Amal Ahmed Northeastern University Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that the

Source URL: www.ccs.neu.edu

• Logic
• Theoretical computer science
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Mathematical logic
• Security type system
• Symbol